Binary Spring Search Algorithm for Solving Various Optimization Problems

One of the most powerful tools for solving optimization problems is algorithms (inspired by nature) based on populations. These provide a solution to problem randomly searching in search space. The design’s central idea derived from various natural phenomena, behavior and living conditions organisms, laws physics, etc. A new population-based algorithm called Binary Spring Search Algorithm (BSSA) introduced solve problems. BSSA an simulation famous Hooke’s law (physics) traditional weights springs system. In this proposal, population comprises that are connected unique springs. mathematical modeling proposed presented be used achieve solutions results were thoroughly validated different unimodal multimodal functions; additionally, was compared with high-performance algorithms: binary grasshopper algorithm, dragonfly bat gravitational particle swarm optimization, genetic algorithm. show superiority BSSA. Friedman test corroborate more competitive.